Argumentation Tree: A New Player in your Diagrams

نویسنده

  • Thomas Polacsek
چکیده

The aim of argumentation tree diagram is to organize and visualize, in a synthetic way, all key elements proving the validity of a product’s property. The argumentation tree does not represent the process, but gives the rational behind all Verification & Validation (V&V) documents. In fact, it lists and organizes necessary evidence in a development life cycle. But the validity of the final assessment requires the validation and the identification of the evidence of each intermediate step. So, in this article, we introduce a generic argumentation pattern and its derivations whose support a rational organization of all V&V evidence at each step. This pattern stems from legal science and argumentation theory legacies, and it is the basic building block for the argumentation tree construction. MOTS-CLÉS : patron d’argumentation, vérification et validation, ingénierie des exigences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basic influence diagrams and the liberal stable semantics

This paper is concerned with the general problem of constructing decision tables and more specifically, with the identification of all possible outcomes of decisions. We introduce and propose basic influence diagrams as a simple way of describing problems of decision making under strict uncertainty. We then establish a correspondence between basic influence diagrams and symmetric generalised as...

متن کامل

Debate Games in Logic Programming

A debate game provides an abstract model of debates between two players based on the formal argumentation framework. This paper presents a method of realizing debate games in logic programming. Two players have their knowledge bases represented by extended logic programs and build claims using arguments associated with those programs. A player revises its knowledge base with arguments posed by ...

متن کامل

MCTS Experiments on the Voronoi Game

Monte-Carlo Tree Search (MCTS) is a powerful tool in games with a finite branching factor. This paper describes an artificial player playing the Voronoi game, a game with an infinite branching factor. First, this paper shows how to use MCTS on a discretization of the Voronoi game, and the effects of enhancements such as RAVE and Gaussian processes (GP). A first set of experimental results shows...

متن کامل

Some Thoughts on Using Computers to Teach Argumentation

Argumentation has become a “hot topic” of AI research – especially outside the United States. The last year or two have seen AI Journal special issues devoting more than 300 pages to argumentation in AI, a new series of conferences on Computational Models of Argument, and a recent Dagstuhl Perspectives Seminar on Theory and Practice of Argumentation Systems, focusing on the future of argumentat...

متن کامل

Strategic Argumentation Under Grounded Semantics is NP-Complete

We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move to play at each turn in order to prove (disprove) a given claim. We shall prove that this is an NP-complete problem. The result covers one the most popular argumentation semantics proposed by Dung [4]: the grounded semantics.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016